Inner product encryption from ring learning with errors

Functional Encryption for Inner Product Predicates from Learning with Errors

We propose a lattice-based functional encryption scheme for inner product predicates whose security follows from the difficulty of the learning with errors (LWE) problem. This construction allows us to achieve applications such as range and subset queries, polynomial evaluation, and CNF/DNF formulas on encrypted data. Our scheme supports inner products over small fields, in contrast to earlier ...

Identity Based Encryption from Learning With Errors

Bi-Deniable Inner Product Encryption from LWE

Deniable encryption (Canetti et al. CRYPTO ’97) is an intriguing primitive that provides a security guarantee against not only eavesdropping attacks as required by semantic security, but also stronger coercion attacks performed after the fact. The concept of deniability has later demonstrated useful and powerful in many other contexts, such as leakage resilience, adaptive security of protocols,...

Improved (Hierarchical) Inner-Product Encryption from Lattices

Inner-product encryption (IPE) provides fine-grained access control and has attractive applications. Agrawal, Freeman, and Vaikuntanathan (Asiacrypt 2011) proposed the first IPE scheme from lattices by twisting the identity-based encryption (IBE) scheme by Agrawal, Boneh, and Boyen (Eurocrypt 2010). Their IPE scheme supports inner-product predicates over Rμ , where the ring is R = Zq . Several ...

Function-Hiding Inner Product Encryption

We extend the reach of functional encryption schemes that are provably secure under simpleassumptions against unbounded collusion to include function-hiding inner product schemes.Our scheme is a private key functional encryption scheme, where ciphertexts correspond tovectors ~x, secret keys correspond to vectors ~y, and a decryptor learns 〈~x, ~y〉. Our schemeemploys asymmetr...